Avoiding Saturation By Trajectory Reparameterization
نویسنده
چکیده
The problem of trajectory tracking in the presence of input constraints is considered. The desired trajectory is reparameterized on a slower time scale in order to avoid input saturation. Necessary conditions that the reparameterizing function must satisfy are derived. The deviation from the nominal trajectory is minimized by formulating the problem as an optimal control problem.
منابع مشابه
Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgetting
In this paper we propose an approach to avoiding catastrophic forgetting in sequential task learning scenarios. Our technique is based on a network reparameterization that approximately diagonalizes the Fisher Information Matrix of the network parameters. This reparameterization takes the form of a factorized rotation of parameter space which, when used in conjunction with Elastic Weight Consol...
متن کاملOptimal Trajectory Generation for Energy Consumption Minimization and Moving Obstacle Avoidance of SURENA III Robot’s Arm
In this paper, trajectory generation for the 4 DOF arm of SURENA III humanoid robot with the purpose of optimizing energy and avoiding a moving obstacle is presented. For this purpose, first, kinematic equations for a seven DOF manipulator are derived. Then, using the Lagrange method, an explicit dynamics model for the arm is developed. In the next step, in order to generate the desired traject...
متن کاملAdaptive Control with a Nested Saturation Reference Model
This paper introduces a neural network based model reference adaptive control architecture that allows adaptation in the presence of saturation. The given plant is approximately feedback linearized, with adaptation used to cancel any matched uncertainty. A nested saturation based reference model is used. This law allows the incorporation of magnitude actuator saturation and has useful small gai...
متن کاملFast Trajectory Optimization for Agile Quadrotor Maneuvers with a Cable-Suspended Payload
Executing agile quadrotor maneuvers with cablesuspended payloads is a challenging problem and complications induced by the dynamics typically require trajectory optimization. State-of-the-art approaches often need significant computation time and complex parameter tuning. We present a novel dynamical model and a fast trajectory optimization algorithm for quadrotors with a cable-suspended payloa...
متن کاملF-saturation games
We study F-saturation games, rst introduced by Füredi, Reimer and Seress [4] in 1991, and named as such by West [5]. The main question is to determine the length of the game whilst avoiding various classes of graph, playing on a large complete graph. We show lower bounds on the length of path-avoiding games, and more precise results for short paths. We show sharp results for the tree avoiding g...
متن کامل